A proximal point method for nonsmooth convex optimization problems in Banach spaces

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proximal Point Method for Nonsmooth Convex Optimization Problems in Banach Spaces

In this paper we show the weak convergence and stability of the proximal point method when applied to the constrained convex optimization problem in uniformly convex and uniformly smooth Banach spaces. In addition, we establish a nonasymptotic estimate of convergence rate of the sequence of functional values for the unconstrained case. This estimate depends on a geometric characteristic of the ...

متن کامل

A Generalized Proximal-Point Method for Convex Optimization Problems in Hilbert Spaces∗

We deal with a generalization of the proximal-point method and the closely related Tikhonov regularization method for convex optimization problems. The prime motivation behind this is the well-known connection between the classical proximal-point and augmented Lagrangian methods, and the emergence of modified augmented Lagrangian methods in recent years. Our discussion includes a formal proof o...

متن کامل

Regularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces

Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set ...

متن کامل

Descent methods for convex optimization problems in Banach spaces

where f : E→ R is a convex function; see, for example, [1, 2, 8] and the references therein. It is well known that standard iterative methods for solving (1.2), which are designed for finite-dimensional optimization problems, cannot guarantee strong convergence of their iteration sequences to a solution of the initial problem if the cost function does not possess strengthened convexity properti...

متن کامل

A proximal point method in nonreflexive Banach spaces

We propose an inexact version of the proximal point method and study its properties in nonreflexive Banach spaces which are duals of separable Banach spaces, both for the problem of minimizing convex functions and of finding zeroes of maximal monotone operators. By using surjectivity results for enlargements of maximal monotone operators, we prove existence of the iterates in both cases. Then w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 1997

ISSN: 1085-3375

DOI: 10.1155/s1085337597000298